A New Approach for Solving Interval Quadratic Programming Problem

A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS

Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...

A new approach for solving fuzzy multi-objective quadratic programming of water resource allocation problem

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

A new solving approach for fuzzy flexible programming problem in uncertainty conditions

Modeling and solving real world problems is one of the most important issues in optimization problems. In this paper, we present an approach to solve Fuzzy Interval Flexible Linear Programming (FIFLP) problems that simultaneously have the interval ambiguity in the matrix of coefficients .In the first step, using the interval problem solving techniques; we transform the fuzzy interval flexible p...

A new approach for solving neutrosophic integer programming problems

Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...

Simulated Annealing Approach for Solving Bilevel Programming Problem

Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...